A Bundle Method for Integrated Multi-Depot Vehicle and Duty Scheduling in Public Transit
نویسندگان
چکیده
This article proposes a Lagrangean relaxation approach to solve integrated duty and vehicle scheduling problems arising in public transport. The approach is based on the proximal bundle method for the solution of concave decomposable functions, which is adapted for the approximate evaluation of the vehicle and duty scheduling components. The primal and dual information generated by the bundle method is used to guide a branch-and-bound type algorithm. Computational results for large-scale real-world integrated vehicle and duty scheduling problems with up to 1,500 timetabled trips are reported. Compared with the results of a classical sequential approach and with reference solutions, integrated scheduling offers remarkable potentials in savings and drivers’ satisfaction.
منابع مشابه
Development of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملA New Solution Model for Multi-depot Multi-vehicle-type Vehicle Scheduling in (sub)urban Public Transport
The Vehicle Scheduling Problem (VSP) is the task of building an optimal set of rotations (vehicle schedule), such that each trip of a given timetable is covered by exactly one rotation. The restrictions and optimization criteria may differ from one problem setting to another. For multi-depot, multi-vehicle-type VSP for bus transit, each one-day rotation must end at the depot of start and is to ...
متن کاملLagrangean Relaxations and Subgradient Methods for Multiple-depot Vehicle Scheduling Problems Lagrangean Relaxations and Subgradient Methods for Multiple-depot Vehicle Scheduling Problems
This paper presents two Lagrangean relaxation approaches for the NP-hard multiple-depot vehicle scheduling problem in public mass transit and reports on computational investigations. Our Lagrangean relaxation approaches can be applied to generate very tight lower bounds and to compute feasible solutions eeciently. A further application is to use the Lagrangean relaxations as new pricing strateg...
متن کاملA multi-objective memetic algorithm for risk minimizing vehicle routing problem and scheduling problem
In this paper, a new approach to risk minimizing vehicle routing and scheduling problem is presented. Forwarding agents or companies have two main concerns for the collection of high-risk commodities like cash or valuable commodities between the central depot and the customers: one; because of the high value of the commodities transported, the risk of ambush and robbery are very high. Two; the ...
متن کاملMultiple-Depot Integrated Vehicle and Crew Scheduling
This paper presents two different models and algorithms for integrated vehicle and crew scheduling in the multiple-depot case. The algorithms are both based on a combination of column generation and Lagrangian relaxation. Furthermore, we compare those integrated approaches with each other and with the traditional sequential one on random generated as well as real-world data instances for a subu...
متن کامل